A Heuristic Local-sensitive Program-Wide Diffing Method for IoT Binary Files

نویسندگان

چکیده

Abstract Code reuse brings vulnerabilities in third-party library to many Internet of Things (IoT) devices, opening them attacks such as distributed denial service. Program-wide binary diffing technology can help detect these IoT devices whose source codes are not public. Considering the architectures may vary, we propose a data-aware program-wide method across and optimization levels. We rely on defined anchor functions call relationship expand comparison scope within target file, reducing impact different result. To make result more accurate, extract semantic features that represent code by data flow dependence analysis. Earth mover distance is used calculate similarity two files based features. implemented proof-of-concept DAPDiff compared it with baseline BinDiff, TurboDiff Asm2vec. Experiments showed availability effectiveness our levels architectures. outperformed BinDiff recall precision 41.4% 9.2% average when making between standard real-world firmware files. This proves be applicable for vulnerability detection devices.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A novel local search method for microaggregation

In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least k and at most 2k_1 records, such that the sum of the within-group squ...

متن کامل

A BINARY LEVEL SET METHOD FOR STRUCTURAL TOPOLOGY OPTIMIZATION

This paper proposes an effective algorithm based on the level set method (LSM) to solve shape and topology optimization problems. Since the conventional LSM has several limitations, a binary level set method (BLSM) is used instead. In the BLSM, the level set function can only take 1 and -1 values at convergence. Thus, it is related to phase-field methods. We don’t need to solve the Hamilton-Jac...

متن کامل

A New Heuristic Algorithm for Drawing Binary Trees within Arbitrary Polygons Based on Center of Gravity

Graphs have enormous usage in software engineering, network and electrical engineering. In fact graphs drawing is a geometrically representation of information. Among graphs, trees are concentrated because of their ability in hierarchical extension as well as processing VLSI circuit. Many algorithms have been proposed for drawing binary trees within polygons. However these algorithms generate b...

متن کامل

A New Sensitive Method for Detection of Viroids

Background and Aims: Viroids are smallest known plant pathogens and cause several economically significant diseases. Until recently, viroid detection relied mainly on biological tests and indexing. Today various diagnostic techniques such as nucleic acid hybridization, southern blot and reverse transcription coupled with polymerase chain reaction (RT-PCR) are being used for detection and diag...

متن کامل

A Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular Strip-Packing Problem

T paper presents a binary search heuristic algorithm for the rectangular strip-packing problem. The problem is to pack a number of rectangles into a sheet of given width and infinite height so as to minimize the required height. We first transform this optimization problem into a decision problem. A least-waste-first strategy and a minimal-inflexion-first strategy are proposed to solve the rela...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Arabian journal for science and engineering

سال: 2021

ISSN: ['2191-4281', '2193-567X']

DOI: https://doi.org/10.1007/s13369-021-06342-8